Matching the demand

The Demand Matching Problem

We examine formulations for the well-known b-matching problem in the presence of integer demands on the edges. A subset M of edges is feasible if for each node v the total demand of edges in M incident to v is at most bv . We examine the system of star inequalities for this problem. This system yields an exact linear description for b-matchings in bipartite graphs. For the demand version, we sh...

User-Defined On-Demand Matching

Energy at heart: matching demand with production.

How are energy-consuming processes matched with energy supply in constantly working heart muscle cells? A new piece in the puzzle of myocardial gene regulation indicates that two main inducers of energy production also increase the abundance of a major consumer. Watanabe et al. convincingly demonstrate that mitochondrial transcription factors A (TFAM) and B2 (TFB2M) not only stimulate mitochond...

Market-oriented online supply-demand matching

Iterative Packing for Demand and Hypergraph Matching

Iterative rounding has enjoyed tremendous success in elegantly resolving open questions regarding the approximability of problems dominated by covering constraints. Although iterative rounding methods have been applied to packing problems, no single method has emerged that matches the effectiveness and simplicity afforded by the covering case. We offer a simple iterative packing technique that ...